An Improved Fast Watershed Algorithm based on finding the Shortest Paths with Breadth First Search
نویسندگان
چکیده
A watershed based on rainfall simulation is a proven technique for image segmentation. The only problem associated with it is the path regularization for pixels in the plateau. As the existing methods employ sequential techniques, the complexity of the algorithms remains high due to repetitive scanning of pixels. We propose an iterative method for finding the shortest and steepest path based on Breadth first search (BFS), which addresses the path regularization problem eliminating the repetitive scans. Experiments show, that the proposed algorithm significantly reduces the running time without compensating the performance when compared with the fastest known algorithm.
منابع مشابه
Cs 267 Lecture 3
Single-source shortest paths. In the single-source shortest paths problem (SSSP), we are given a graph G = (V,E) and a source node s ∈ V , and we must compute d(s, v) for all v ∈ V . If the graph is unweighted, we can solve this in O(m + n) time by breadth-first search (BFS). If the graph has nonnegative integer weights, we can use Dijkstra’s algorithm with Fibonacci heaps, yielding a runtime o...
متن کاملA Randomized Parallel Algorithm for Single-Source Shortest Paths
We give a randomized parallel algorithm for computing single-source shortest paths in weighted digraphs. We show that the exact shortest-path problem can be efficiently reduced to solving a series of approximate shortest-path subproblems. Our algorithm for the approximate shortest-path problem is based on the technique used by Ullman and Yannakakis in a parallel algorithm for breadth-first sear...
متن کاملA Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web requests and so on. We also have orthogonal applications of FCFS policies in proving correctness of search algorithms such as Breadth-First Search and the Bellman-Ford FIFO implementation for finding single-source shor...
متن کاملOptimizing Communication by Compression for Multi-GPU Scalable Breadth-First Searches
The Breadth First Search (BFS) algorithm is the foundation and building block of many higher graph-based operations such as spanning trees, shortest paths and betweenness centrality. The importance of this algorithm increases each day due to it is a key requirement for many data structures which are becoming popular nowadays. When the BFS algorithm is parallelized by distributing the graph betw...
متن کاملA Graph Search Heuristic for Shortest Distance Paths
This paper presents a heuristic for guiding A* search for finding the shortest distance path between two vertices in a connected, undirected, and explicitly stored graph. The heuristic requires a small amount of data to be stored at each vertex. The heuristic has application to quickly detecting relationships between two vertices in a large information or knowledge network. We compare the perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016